A unified approach for large queue asymptotics in a heterogeneous multiserver queue
نویسندگان
چکیده
منابع مشابه
The Probability of Large Queue Lengths and Waiting times in a Heterogeneous Multiserver Queue Part I: Tight Limits
We consider a multiserver queuing process speciied by i.i.d. interarrival time, batch size and service time sequences. In the case that diierent servers have diierent service time distributions we say the system is heterogeneous. In this paper we establish conditions for the queuing process to be characterized as a geometrically Harris recurrent Markov chain, and we characterize the stationary ...
متن کاملAn Efficient Computation Algorithm for A Multiserver Feedback Retrial Queue With A Large Queueing Capacity
Kumar et al. consider the M/M/c/N+c feedback queue with constant retrial rate [1]. They provide a solution for the steady state probability based on the matrix-geometric method. We show that there exists a more efficient computation method to calculate the steady state probabilities when N + c is large. We prove that the number of zero-eigenvalues of the characteristic matrix polynomial associa...
متن کاملQueue with Heterogeneous Server Under Resequencing Constraint
In this paper, a markovian queue with two types of servers and buffer space is considered. The resequencing constraint is imposed according to which the customers leave the system in the same order in which they entered it. For finite buffer queue, the steady state queue size distribution has been obtained.?
متن کاملA Finite-Source Multiserver Queue with Preemptive Priorities
We consider systems with finite sources of requests, multiple servers, and an arbitrary number of preemptive priority classes. The service times and the source idle times are assumed to be exponentially distributed. We present an efficient approach based on marginal state description. The approach allows a recurrent analysis of priority levels where the usage of servers by higher priority reque...
متن کاملOn a Multiserver Finite Buffer Queue with Impatient
In this paper we study a multiserver finite buffer queue in which customers have an stochastic deadline of phase-type until the beginning of their service. The following service disciplines are considered: FCFS (First-Come First-Served), LCFS (Last-Come First-Served) and SIRO (Service In Random Order) along with a parameterizable probabilistic push-out mechanism. Although this model has many ap...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Applied Probability
سال: 2017
ISSN: 0001-8678,1475-6064
DOI: 10.1017/apr.2016.84